# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def subArrayRanges(self, nums: List[int]) -> int:
        ans = 0
        num_len = len(nums)
        for i in range(num_len):
            max_value = min_value = nums[i]
            for j in range(i + 1, num_len):
                max_value = max(max_value, nums[j])
                min_value = min(min_value, nums[j])
                ans += max_value - min_value

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1,2,3], 4),
        ([1,3,3], 4),
        ([4,-2,-3,4,1], 59)

    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.subArrayRanges(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

